Practical Aspects of Membership Problem of Watson-Crick Context-free Grammars

This paper focuses on Watson-Crick languages inspired by DNA computing, their models, and algorithms for deciding the language membership. It analyzes a recently introduced algorithm called WK-CYK introduces state space search that is based regular Breadth-first but uses number of optimizations heuristics to be efficient in practical use able analyze longer inputs. The key parts are pruning (detecting dead ends) choosing most promising branches continue search. These two have been tested with 20 different grammars (40 including Chomsky normal form versions). While decide membership reasonable time inputs length roughly 30-50 symbols its performance very consistent all kinds inputs, usually (89-98 % cases) more do computation lengths hundreds or even thousands symbols. Thus, has potential good tool testing basis improvement efficiency future.